Discovering Motifs in Ranked Lists of DNA Sequences
نویسندگان
چکیده
منابع مشابه
Discovering Motifs in Ranked Lists of DNA Sequences
Computational methods for discovery of sequence elements that are enriched in a target set compared with a background set are fundamental in molecular biology research. One example is the discovery of transcription factor binding motifs that are inferred from ChIP-chip (chromatin immuno-precipitation on a microarray) measurements. Several major challenges in sequence motif discovery still requi...
متن کاملRegmex, Motif analysis in ranked lists of sequences
Motif analysis has long been an important method to characterize biological functionality and the current growth of sequencing-based genomics experiments further extends its potential. These diverse experiments often generate sequence lists ranked by some functional property. There is therefore a growing need for motif analysis methods that can exploit this coupled data structure and be tailore...
متن کاملEfficient motif search in ranked lists and applications to variable gap motifs
Sequence elements, at all levels-DNA, RNA and protein, play a central role in mediating molecular recognition and thereby molecular regulation and signaling. Studies that focus on -measuring and investigating sequence-based recognition make use of statistical and computational tools, including approaches to searching sequence motifs. State-of-the-art motif searching tools are limited in their c...
متن کاملCanberra distance on ranked lists
The Canberra distance is the sum of absolute values of the differences between ranks divided by their sum, thus it is a weighted version of the L1 distance. As a metric on permutation groups, the Canberra distance is a measure of disarray for ranked lists, where rank differences in top positions need to pay higher penalties than movements in the bottom part of the lists. Here we describe the di...
متن کاملA marginal mixture model for discovering motifs in sequences
In this study we present a marginal mixture model for discovering probabilistic motifs in categorical sequences. The proposed method is based on a general framework for developing, extending and marginalizing expressive motif models that encapsulates spatial information. Two alternative schemes for constructing expressive models are described, the extend and the marginal approach. The EM algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS Computational Biology
سال: 2007
ISSN: 1553-7358
DOI: 10.1371/journal.pcbi.0030039